منابع مشابه
Strong S-equivalence of Ordered Links
Recently Swatee Naik and Theodore Stanford proved that two Sequivalent knots are related by a finite sequence of doubled-delta moves on their knot diagrams. We show that classical S-equivalence is not sufficient to extend their result to ordered links. We define a new algebraic relation on Seifert matrices, called Strong S-equivalence, and prove that two oriented, ordered links L and L are rela...
متن کاملNotions of Strong Equivalence for Logic Programs with Ordered Disjunction
Ordered disjunctions have been introduced as a simple, yet expressive approach for representing preferential knowledge by means of logic programs. The semantics for the resulting language is based on the answer-set semantics, but comes in different variants, depending on the particular interpretation of preference aggregation associated to the ordered disjunction connective. While in standard a...
متن کاملOrbit equivalence, flow equivalence and ordered cohomology
We study self-homeomorphisms of zero dimensional metrizable compact Hausdorff spaces by means of the ordered first cohomology group, particularly in the light of the recent work of Giordano, Putnam, and Skau on minimal homeomorphisms. We show that flow equivalence of systems is analogous to Morita equivalence between algebras, and this is reflected in the ordered cohomology group. We show that ...
متن کاملCharacterizing Notions of Strong Equivalence for Logic Programs with Ordered Disjunctions
Ordered disjunctions have recently been introduced as a simple, yet expressive approach for representing preferential knowledge by means of logic programs. The semantics for the resulting language is based on the answer-set semantics, but comes in different flavors, depending on the particular notion of preference associated to the disjunction connective. While in standard answer-set programmin...
متن کاملStrong Splitting Bisimulation Equivalence
We present ACP, a process algebra with conditional expressions in which the conditions are taken from a Boolean algebra, and extensions of this process algebra with mechanisms for condition evaluation. We confine ourselves to finitely branching processes. This restriction makes it possible to present ACP in a concise and intuitively clear way, and to bring the notion of splitting bisimulation e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Knot Theory and Its Ramifications
سال: 2008
ISSN: 0218-2165,1793-6527
DOI: 10.1142/s0218216508006476